Virtual Shared Memory: Algorithms and Complexity

Parallel Buchberger Algorithms on Virtual Shared Memory KSR1

We develop parallel versions of Buchbergers Gröbner Basis algorithm for a virtual shared memory KSR1 computer. A coarse grain version does S-polynomial reduction concurrently and respects the same critical pair selection strategy as the sequential algorithm. A fine grain version parallelizes polynomial reduction in a pipeline and can be combined with the parallel S-polynomial reduction. The alg...

Virtual Shared Memory and Distributed Memory Implementations of Parallel Algorithms for Numerical Integration

Parallel globally adaptive algorithms for numerical integration provide a simple example of algorithms that exploit control parallelism. In this paper we consider the implementation of such algorithms on both virtual shared memory (KSR-1) and distributed memory (iPSC/860) machines and investigate how the characteristics of the diierent architectures aaect the choice of implementation and thereb...

vNUMA: Virtual shared-memory multiprocessors

Shared memory systems, such as SMP and ccNUMA topologies, simplify programming and administration. On the other hand, systems without hardware support for shared memory, such as clusters of commodity workstations, are commonly used due to cost and flexibility considerations. In this thesis, virtualisation is proposed as a technique that can bridge the gap between these architectures. The result...

Shared Virtual Memory: a Survey

Shared Virtual Memory and Generalized Speedup

Generalized speedup is de ned as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as traditional speedup, e ciency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, we show that the di erence between the generalized speedup and the traditional speedup lies in the de ni...